Cryptography with Asynchronous Logic Automata
نویسندگان
چکیده
We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. An implementation of the A5/1 stream cipher is provided as a design example in a concise hardware description language, Snap, and we discuss a powerand timingbalanced cell design.
منابع مشابه
Selected Topics in Asynchronous Automata
The paper is concerned with the modeling of the electrical signals and of the asynchronous circuits by } 1 , 0 { → R functions and asynchronous automata. The equations of the asynchronous automata are written and solved; the stability, the fundamental mode of operation, the semi-modularity and some aspects of semantics of the propositional temporal logic as seen from behind asynchronous automat...
متن کاملA temporal logic for the specification and verification of distributed behaviour
In this work we develop a temporal logic with fixpoints for distributed processes or distributed systems. Standard temporal logics refer to sequential processes (execution sequences) of distributed systems. Expressive temporal operators such as “Until” can be expressed as fixpoints of formulae involving only the simple “Next” modality. Fixpoint logics for sequential processes are known to be ex...
متن کاملAsynchronous logic automata
Numerous applications, from high-performance scientific computing to large, highresolution multi-touch interfaces to strong artifical intelligence, push the practical physical limits of modern computers. Typical computers attempt to hide the physics as much as possible, running software composed of a series of instructions drawn from an arbitrary set to be executed upon data that can be accesse...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملAutomata as $p$-adic Dynamical Systems
The automaton transformation of infinite words over alphabet Fp = {0, 1, . . . , p− 1}, where p is a prime number, coincide with the continuous transformation (with respect to the p-adic metric) of a ring Zp of p-adic integers. The objects of the study are non-Archimedean dynamical systems generated by automata mappings on the space Zp. Measure-preservation (with the respect to the Haar measure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012